Some New Exact van der Waerden numbers

نویسندگان

  • Bruce Landman
  • Aaron Robertson
چکیده

For positive integers r, k0, k1, ..., kr−1, the van der Waerden number w(k0, k1, ..., kr−1) is the least positive integer n such that whenever {1, 2, . . . , n} is partitioned into r sets S0, S1, ..., Sr−1, there is some i so that Si contains a ki-term arithmetic progression. We find several new exact values of w(k0, k1, ..., kr−1). In addition, for the situation in which only one value of ki differs from 2, we give a precise formula for the van der Waerden function (provided this one value of ki is not too small).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the van der Waerden numbers w(2;3,t)

On the van der Waerden numbers w(2; 3, t) Abstract In this paper we present results and conjectures on the van der Waerden numbers w(2; 3, t). We have computed the exact value of the previously unknown van der Waerden number w(2; 3, 19) = 349, and we provide new lower bounds for t = 30, we conjecture these bounds to be exact. The lower bounds for w(2; 3, t) with t = 24,. .. , 30 refute the conj...

متن کامل

A van der Waerden Variant

The classical van der Waerden Theorem says that for every every finite set S of natural numbers and every k-coloring of the natural numbers, there is a monochromatic set of the form aS+b for some a > 0 and b ≥ 0. I.e., monochromatism is obtained by a dilation followed by a translation. We investigate the effect of reversing the order of dilation and translation. S has the variant van der Waerde...

متن کامل

A New Method to Construct Lower Bounds for Van der Waerden Numbers

We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this method we improved seven lower bounds. For natural numbers r, k and n a Van der Waerden certificate W (r, k, n) is a partition of {1, . . . , n} into r subsets, such that none of them contains an arithmetic progression of length k (or larger). Van der Waerden showed that given r an...

متن کامل

The 2-color relative linear Van der Waerden numbers

We define the r-color relative linear van der Waerden numbers for a positive integer r as generalizations of the polynomial van der Waerden numbers of linear polynomials. Especially we express a sharp upper bound of the 2-color relative linear van der Waerden number Rf2(u1, u2, . . . , um : s1, s2, . . . , sk) in terms of a (k + 1)-color polynomial van der Waerden number for positive integers m...

متن کامل

Avoiding triples in arithmetic progression ∗

Some patterns cannot be avoided ad infinitum. A well-known example of such a pattern is an arithmetic progression in partitions of natural numbers. We observed that in order to avoid arithmetic progressions, other patterns emerge. A visualization is presented that reveals these patterns. We capitalize on the observed patterns by constructing techniques to avoid arithmetic progressions. More for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005